GMO: geometric mean optimizer for solving engineering problems
نویسندگان
چکیده
This paper introduces a new meta-heuristic technique, named geometric mean optimizer (GMO) that emulates the unique properties of operator in mathematics. can simultaneously evaluate fitness and diversity search agents space. In GMO, scaled objective values certain agent’s opposites is assigned to agent as its weight representing overall eligibility guide other process when solving an optimization problem. Furthermore, GMO has no parameter tune, contributing results be highly reliable. The competence problems verified via implementation on 52 standard benchmark test including 23 classical functions, 29 CEC2017 functions well nine constrained engineering problems. presented by are then compared with those offered several newly proposed popular algorithms. demonstrate significantly outperforms competitors vast range Source codes publicly available at https://github.com/farshad-rezaei1/GMO .
منابع مشابه
FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملFlying Squirrel Optimizer (FSO): A novel SI-based optimization algorithm for engineering problems
This paper provides a novel meta-heuristic optimization algorithm. The behaviors of flying squirrels in the nature are the main inspiration of this research. These behaviors include flying from tree to tree and walking on the ground or on a tree branch to find food. They also contact each other with chirp or squeak. This algorithm is named flying squirrel optimizer (FSO). Two main theories of m...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملSolving Geometric Optimization Problems
We show how to use graphics hardware for tackling optimization problems arising in the field of computational geometry. We exemplarily discuss three problems, where combinatorial algorithms are inefficient or hard to implement. Given a set S of n point in the plane, the first two problems are to determine the smallest homothetic scaling of a star shaped polygon P enclosing S and to find the lar...
متن کاملSolving Engineering Optimization Problems with the Simple Constrained Particle Swarm Optimizer
This paper introduces a particle swarm optimization algorithm to solve constrained engineering optimization problems. The proposed approach uses a relatively simple method to handle constraints and a different mechanism to update the velocity and position of each particle. The algorithm is validated using four standard engineering design problems reported in the specialized literature and it is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2023
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-023-08202-z